Response to the Comment on "Geodesic Saliency of Watershed Contours and Hierarchical Segmentation"
نویسنده
چکیده
This paper presents in details the algorithm of the watershed, which we have sketched in Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 12, pp 1,163-1,173 and criticized in this issue. First, the formal definition of the flooding list, the key data structure of the algorithm, is given. Then, the construction of this flooding list and of the watershed are described and proved.
منابع مشابه
Comments on “Geodesic Saliency of Watershed Contours and Hierarchical Segmentation”
In a recent paper on morphological image segmentation [1], Najman and Schmitt introduce the powerful concept of edge dynamics. In this communication, we show that the method that they propose to compute the edge dynamics gives erroneous results for certain spatial configurations, and we propose a new algorithm which always yields correct edge dynamics.
متن کاملGeodesic Saliency of Watershed Contours and Hierarchical Segmentation
In a recent paper on morphological image segmentation [1], Najman and Schmitt introduce the powerful concept of edge dynamics. In this communication we show that the method that they propose to compute the edge dynamics gives erroneous results for certain spatial configurations, and we propose a new algorithm which always yields correct edge dynamics.
متن کاملHierarchical Watersheds Within the Combinatorial Pyramid Framework
Watershed is one of the most popular tool defined by mathematical morphology. The algorithms which implement the watershed transform generally produce an over segmentation which includes the right image’s boundaries. Based on this last assumption, the segmentation problem turns out to be equivalent to a proper valuation of the saliency of each contour. Using such a measure, hierarchical watersh...
متن کاملIncremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts
We study hierarchical segmentations that are optimal in the sense of minimal spanning forests of the original image. We introduce a region-merging operation called uprooting, and we prove that optimal hierarchical segmentations are equivalent to the ones given by uprooting a watershed-cut based segmentation. Based on those theoretical results, we propose an efficient algorithm to compute such h...
متن کاملAssessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation
Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Pattern Anal. Mach. Intell.
دوره 20 شماره
صفحات -
تاریخ انتشار 1998